A Coprocessor for Traffic Scheduling and Schedulability Analysis in FTT-CAN

نویسندگان

  • Ernesto Martins
  • José Fonseca
  • Luis Almeida
چکیده

The low-processing power microcontrollers used within typical CAN nodes, usually place tight limits on the complexity and flexibility of on-line message scheduling systems. One solution to break this barrier is to transfer the scheduling task to a hardware implementation. A traffic scheduling and schedulability analyser coprocessor is presented in this paper. The coprocessor generates message schedules for the master node CPU of a fieldbus system, leaving it just with the dispatching task. Scheduling can be made to follow one of three different policies. The number of messages to be scheduled and their parameters can be changed dynamically. To support on-line admission control of new messages, the coprocessor implements a schedulability analyser function. The coprocessor was designed to support the FTT-CAN protocol, but it can be adapted to any other fieldbus using centralised scheduling. The description presented here is focused mainly on the coprocessor’s overall functionality and interface with the node CPU. To characterise its performance, calculated response times are presented.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Error Recovery in the Time-Triggered Paradigm with FTT-CAN

Data networks are naturally prone to interferences that can corrupt messages, leading to performance degradation or even to critical failure of the corresponding distributed system. To improve resilience of critical systems, time-triggered networks are frequently used, based on communication schedules defined at design-time. These networks offer prompt error detection, but slow error recovery t...

متن کامل

A faster exact schedulability analysis for fixed-priority scheduling

Real-time scheduling for task sets has been studied, and the corresponding schedulability analysis has been developed. Due to the considerable overheads required to precisely analyze the schedulability of a task set (referred to as exact schedulability analysis), the trade-off between precision and efficiency is widely studied. Many efficient but imprecise (i.e., sufficient but not necessary) a...

متن کامل

Developments in Flexible Time-Triggered Switched Ethernet

The Flexible Time-Triggered Switched Ethernet (FTT-SE) protocol was proposed in 2006 [1] as a realization of the FTT paradigm [2] specifically adapted to switched Ethernet. This paradigm first appeared in 1998 implemented on CAN, the FTT-CAN protocol [3], followed by an implementation on shared Ethernet in 2002 [4]. The FTT paradigm is a framework to develop distributed real-time systems that a...

متن کامل

Holistic analysis of asynchronous real-time transactions with earliest deadline scheduling

In distributed real-time systems, an application is often modeled as a set of real-time transactions, where each transaction is a chain of precedence-constrained tasks. Each task is statically allocated to a processor, and tasks allocated on the same processor are handled by a single-processor scheduling algorithm. Precedence constraints among tasks of the same transaction are modeled by proper...

متن کامل

Schedulability Analysis for Fixed Priority Wormhole Switching in On-Chip Networks

In this paper, we discuss a real-time on-chip communication service with a priority-based wormhole switching policy. A novel off-line schedulability analysis approach and its extension are presented. By evaluating diverse inter-relationships among the traffic-flows, this approach can predict the packet network latency for all practical situations. Due to the inevitable existence of parallel int...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002